Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082027
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082027 a(1)=6; a(n) is concatenation of the squares of each digit of a(n-1), in order (in base 10). +0
1
6, 36, 936, 81936, 64181936, 3616164181936, 93613613616164181936, 819361936193613613616164181936, 641819361819361819361936193613613616164181936 (list; graph; listen)
OFFSET

1,1

COMMENT

If m is a member of the sequence consisting of k base-10 digits, every member of the sequence greater than m is congruent to m modulo 10^k.

EXAMPLE

a(4)=81936 because the squares of the digits of a(3)--namely, 9, 3 and 6--are 81, 9 and 36 respectively.

CROSSREFS

Cf. A061588, A082026.

Sequence in context: A080491 A077704 A077290 this_sequence A069031 A061234 A061584

Adjacent sequences: A082024 A082025 A082026 this_sequence A082028 A082029 A082030

KEYWORD

base,easy,nonn

AUTHOR

Matthew Vandermast (ghodges14(AT)comcast.net), Apr 01 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research