morgaine/hyper_exponential.nickle

## hyper_exponential.nickle
#! /bin/env nickle
#
# NAME
#       hyper_exponential.nickle
#
# DESCRIPTION
#       Calculates the sequence:
#               1
#               2^2
#               (3^3)^3
#               ((4^4)^4)^4
#               (((5^5)^5)^5)^5
#               ((((6^6)^6)^6)^6)^6
#               ...
#       for terms 1..100
#
# AUTHOR
#       Morgaine Dinovan
#       - Donated to the Public Domain.
#       - Copyright and author's rights waived
#
# COPYRIGHT
#       Public Domain @ 2010-
#
# SEE ALSO
#       http://nickle.org/ -- Great arbitrary precision programming language
#       http://www.research.att.com/~njas/sequences/A053015 -- Sequence citation
#       CodeWarrior Carling -- Expert sequence naming services, ask for a quote
#       Imaze Rhiano - Googling expertise unrivalled, we are not worthy
#
# WARNING
#       This program barely gets started by the time of heat death of the
#       universe.  Don't forget to save your work.
#

int max_term = 100;

for (term=1; term <= max_term; term++)
{
        int base = term;
        for (n = 1; n < term; n++)
        {
                base **= term;
        }

        printf("Calculating term %d of sequence:\n", term);
        printf("%d\t%d\n", term, base);
}
	#! /bin/env nickle
	#
	# NAME
	# hyper_exponential.nickle
	#
	# DESCRIPTION
	# Calculates the sequence:
	# 1
	# 2^2
	# (3^3)^3
	# ((4^4)^4)^4
	# (((5^5)^5)^5)^5
	# ((((6^6)^6)^6)^6)^6
	# ...
	# for terms 1..100
	#
	# AUTHOR
	# Morgaine Dinovan
	# - Donated to the Public Domain.
	# - Copyright and author's rights waived
	#
	# COPYRIGHT
	# Public Domain @ 2010-
	#
	# SEE ALSO
	# http://nickle.org/ -- Great arbitrary precision programming language
	# http://www.research.att.com/~njas/sequences/A053015 -- Sequence citation
	# CodeWarrior Carling -- Expert sequence naming services, ask for a quote
	# Imaze Rhiano - Googling expertise unrivalled, we are not worthy
	#
	# WARNING
	# This program barely gets started by the time of heat death of the
	# universe. Don't forget to save your work.
	#

	int max_term = 100;

	for (term=1; term <= max_term; term++)
	{
	int base = term;
	for (n = 1; n < term; n++)
	{
	base **= term;
	}

	printf("Calculating term %d of sequence:\n", term);
	printf("%d\t%d\n", term, base);
	}